package mo.leetcode_top;

public class L371 {

    public int getSum(int a, int b) {
        while (b != 0) {
            int carry = (a & b) << 1;
            a = a ^ b;
            b = carry;
        }
        return a;
    }

    //0010
    //0011

    //0100

    //0001

    //0000
    //0101

}
